NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth
نویسنده
چکیده
ACCm circuits are circuits consisting of unbounded fan-in AND, OR and MODm gates and unary NOT gates, where m is a fixed integer. We show that there exists a language in non-deterministic exponential time which can not be computed by any non-uniform family of ACCm circuits of quasipolynomial size and o(log log n) depth, where m is an arbitrarily chosen constant.
منابع مشابه
Uniform Circuits, Lower Bounds, and QBF Algorithms
We explore the relationships between circuit complexity, the complexity of generating circuits, and circuit-analysis algorithms. Our results can be roughly divided into three parts: • Lower Bounds Against Medium-Uniform Circuits. Informally, a circuit class is “medium uniform” if it can be generated by an algorithmic process that is somewhat complex but not infeasible. We prove several uncondit...
متن کاملCircuits with composite moduli
This work studies the power of ACC circuits. These are circuits that have modular gates, in addition to the usual AND,OR,NOT. We are particularly interested in circuits where the modulus is a composite number. Our main result is that every ACC circuit of polynomial size and depth d can be reduced to a depth-2 circuit SYM◦AND of size 2(logn)O(d) . This improves exponentially the previously best-...
متن کاملAn Average-Case Lower Bound against ACC
In a seminal work, Williams [26] showed that NEXP (non-deterministic exponential time) does not have polynomial-size ACC circuits. Williams’ technique inherently gives a worst-case lower bound, and until now, no average-case version of his result was known. We show that there is a language L in NEXP (resp. EXP) and a function ε(n) = 1/ log(n) (resp. 1/n) such that no sequence of polynomial size...
متن کاملEasiness Amplification and Uniform Circuit Lower Bounds
We present new consequences of the assumption that time-bounded algorithms can be “compressed” with non-uniform circuits. Our main contribution is an “easiness amplification” lemma for circuits. One instantiation of the lemma says: if n1+ε-time, Õ(n)-space computations have n1+o(1) size (non-uniform) circuits for some ε > 0, then every problem solvable in polynomial time and Õ(n) space has n1+o...
متن کاملOn TC0 Lower Bounds for the Permanent
In this paper we consider the problem of proving lower bounds for the permanent. An ongoing line of research has shown super-polynomial lower bounds for slightly-non-uniform small-depth threshold and arithmetic circuits [All99, KP09, JS11, JS12]. We prove a new parameterized lower bound that includes each of the previous results as sub-cases. Our main result implies that the permanent does not ...
متن کامل